
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2169. -- 连边 -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2169: 连边</h2><span class=green>Time Limit: </span>20 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>259 MB<br><span class=green>Submit: </span>14&nbsp;&nbsp;<span class=green>Solved: </span>10<br>[<a href='submitpage.php?id=2169'>Submit</a>][<a href='problemstatus.php?id=2169'>Status</a>][<a href='bbs.php?id=2169'>Discuss</a>]</center><h2>Description</h2><div class=content><p>有N个点（编号1到N）组成的无向图，已经为你连了M条边。请你再连K条边，使得所有的点的度数都是偶数。求有多少种连的方法。要求你连的K条边中不能有重边，但和已经连好的边可以重。不允许自环的存在。求连边的方法数。我们只关心它模10007的余数。</p></div><h2>Input</h2><div class=content><p>输入的第一行有三个自然数，分别表示点数N，已经连好的边数M，和你要连的边数K。保证K&le;N(N-1)/2 接下来M行每行两个整数x,y，描述了一条连接x和y的边。 30%的数据满足： N&le;200 100%的数据满足： N&le;1000，M&le;N，K&le;1000，K&le;N(N-1)/2</p></div><h2>Output</h2><div class=content><p>输出一个整数，表示连边的方法数模10007的余数</p></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5 1 4<br />
1 2</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>13<br />
【样例说明】<br />
以下是13种连边的方法（只显示你连的边）：<br />
{(1,2),(1,3),(1,4),(3,4)}<br />
{(1,2),(1,3),(1,5),(3,5)}<br />
{(1,2),(1,4),(1,5),(4,5)}<br />
{(1,2),(2,3),(2,4),(3,4)}<br />
{(1,2),(2,3),(2,5),(3,5)}<br />
{(1,2),(2,4),(2,5),(4,5)}<br />
{(1,2),(3,4),(3,5),(4,5)}<br />
{(1,3),(2,4),(3,5),(4,5)}<br />
{(1,3),(2,5),(3,4),(4,5)}<br />
{(1,4),(2,3),(3,5),(4,5)}<br />
{(1,4),(2,5),(3,4),(3,5)}<br />
{(1,5),(2,3),(3,4),(4,5)}<br />
{(1,5),(2,4),(3,4),(3,5)}</span></div><h2>HINT</h2>
			<div class=content><p><p>对于20%的数据， 4&le;N&le;100。对于40%的数据， 4&le;N&le;5000。对于100%的数据，4&le;N&le;50000 1&le;M&le;10 M&le;N 所有出现的整数均不超过32位含符号整数。 时间限制：1s</p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=By 范浩强'>By 范浩强</a></p></div><center>[<a href='submitpage.php?id=2169'>Submit</a>][<a href='problemstatus.php?id=2169'>Status</a>][<a href='bbs.php?id=2169'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
